0.00/0.03 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 180 THM 0.11/0.37 % Computer : n006.cluster.edu 0.11/0.37 % Model : x86_64 x86_64 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.11/0.37 % Memory : 8046.5625MB 0.11/0.37 % OS : Linux 6.8.0-71-generic 0.11/0.37 % CPULimit : 1440 0.11/0.37 % WCLimit : 180 0.11/0.37 % DateTime : Mon Jul 27 14:18:04 UTC 2026 0.11/0.37 % CPUTime : 0.11/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 180 THM 0.11/0.41 Running higher-order theorem proving 0.11/0.45 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox/tmp/tmp.x7yL3pIiMj/E---3.1_2912679.p 0.20/0.50 % Version: 3.5.1-ho 0.20/0.50 % Preprocessing class: HSLMSMSSLLLCHSA. 0.20/0.50 % Scheduled 6 strats onto 8 cores with 180 seconds (1440 total) 0.20/0.50 % Starting lpo1_fix with 540s (3) cores 0.20/0.50 % Starting full_lambda_9 with 180s (1) cores 0.20/0.50 % Starting almost_fo_4 with 180s (1) cores 0.20/0.50 % Starting new_ho_9 with 180s (1) cores 0.20/0.50 % Starting pre_casc_4 with 180s (1) cores 0.20/0.50 % Starting ho_unfolding_6 with 180s (1) cores 0.20/0.50 % pre_casc_4 with pid 2912696 completed with status 0 0.20/0.50 % Result found by pre_casc_4 0.20/0.50 % Preprocessing class: HSLMSMSSLLLCHSA. 0.20/0.50 % Scheduled 6 strats onto 8 cores with 180 seconds (1440 total) 0.20/0.50 % Starting lpo1_fix with 540s (3) cores 0.20/0.50 % Starting full_lambda_9 with 180s (1) cores 0.20/0.50 % Starting almost_fo_4 with 180s (1) cores 0.20/0.50 % Starting new_ho_9 with 180s (1) cores 0.20/0.50 % Starting pre_casc_4 with 180s (1) cores 0.20/0.50 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true)) 0.20/0.50 % SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true) 0.20/0.50 % Search class: HGUSM-FFMM31-DHSMMSBN 0.20/0.50 % partial match(3): HGHSM-FFMM31-SHSSMSBN 0.20/0.50 % Scheduled 7 strats onto 1 cores with 180 seconds (180 total) 0.20/0.50 % Starting SubtermCWHack with 17s (1) cores 0.20/0.50 % SubtermCWHack with pid 2912698 completed with status 0 0.20/0.50 % Result found by SubtermCWHack 0.20/0.50 % Preprocessing class: HSLMSMSSLLLCHSA. 0.20/0.50 % Scheduled 6 strats onto 8 cores with 180 seconds (1440 total) 0.20/0.50 % Starting lpo1_fix with 540s (3) cores 0.20/0.50 % Starting full_lambda_9 with 180s (1) cores 0.20/0.50 % Starting almost_fo_4 with 180s (1) cores 0.20/0.50 % Starting new_ho_9 with 180s (1) cores 0.20/0.50 % Starting pre_casc_4 with 180s (1) cores 0.20/0.50 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true)) 0.20/0.50 % SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true) 0.20/0.50 % Search class: HGUSM-FFMM31-DHSMMSBN 0.20/0.50 % partial match(3): HGHSM-FFMM31-SHSSMSBN 0.20/0.50 % Scheduled 7 strats onto 1 cores with 180 seconds (180 total) 0.20/0.50 % Starting SubtermCWHack with 17s (1) cores 0.20/0.50 % Preprocessing time : 0.004 s 0.20/0.50 0.20/0.50 % Proof found! 0.20/0.50 % SZS status Theorem 0.20/0.50 % SZS output start CNFRefutation 0.20/0.50 thf(decl_23, type, is_of: $i > ($i > $o) > $o). 0.20/0.50 thf(decl_24, type, all_of: ($i > $o) > ($i > $o) > $o). 0.20/0.50 thf(decl_26, type, in: $i > $i > $o). 0.20/0.50 thf(decl_78, type, e_is: $i > $i > $i > $o). 0.20/0.50 thf(decl_124, type, nat: $i). 0.20/0.50 thf(decl_125, type, n_is: $i > $i > $o). 0.20/0.50 thf(decl_143, type, n_pl: $i > $i > $i). 0.20/0.50 thf(decl_154, type, esk1_0: $i). 0.20/0.50 thf(decl_155, type, esk2_0: $i). 0.20/0.50 thf(decl_156, type, esk3_0: $i). 0.20/0.50 thf(def_e_is, axiom, ((e_is)=(^[X1:$i, X60:$i, X61:$i]:(((X60)=(X61))))), file('/export/starexec/sandbox/tmp/tmp.x7yL3pIiMj/E---3.1_2912679.p', def_e_is)). 0.20/0.50 thf(def_all_of, axiom, ((all_of)=(^[X3:$i > $o, X2:$i > $o]:(![X4:$i]:((((is_of @ X4 @ X3))=>((X2 @ X4))))))), file('/export/starexec/sandbox/tmp/tmp.x7yL3pIiMj/E---3.1_2912679.p', def_all_of)). 0.20/0.50 thf(def_is_of, axiom, ((is_of)=(^[X1:$i, X2:$i > $o]:((X2 @ X1)))), file('/export/starexec/sandbox/tmp/tmp.x7yL3pIiMj/E---3.1_2912679.p', def_is_of)). 0.20/0.50 thf(satz19b, conjecture, (all_of @ (^[X1:$i]:((in @ X1 @ nat))) @ (^[X1:$i]:((all_of @ (^[X248:$i]:((in @ X248 @ nat))) @ (^[X249:$i]:((all_of @ (^[X4:$i]:((in @ X4 @ nat))) @ (^[X4:$i]:((((n_is @ X1 @ X249))=>((n_is @ (n_pl @ X1 @ X4) @ (n_pl @ X249 @ X4))))))))))))), file('/export/starexec/sandbox/tmp/tmp.x7yL3pIiMj/E---3.1_2912679.p', satz19b)). 0.20/0.50 thf(def_n_is, axiom, ((n_is)=(^[Z0:$i, Z1:$i]:(((Z0)=(Z1))))), file('/export/starexec/sandbox/tmp/tmp.x7yL3pIiMj/E---3.1_2912679.p', def_n_is)). 0.20/0.50 thf(c_0_5, plain, ((e_is)=(^[Z0:$i, Z1:$i, Z2:$i]:(((Z1)=(Z2))))), inference(fof_simplification,[status(thm)],[def_e_is])). 0.20/0.50 thf(c_0_6, plain, ((all_of)=(^[Z0:$i > $o, Z1:$i > $o]:(![X4:$i]:(((((Z0 @ X4)))=>((Z1 @ X4))))))), inference(fof_simplification,[status(thm)],[def_all_of])). 0.20/0.50 thf(c_0_7, plain, ((is_of)=(^[Z0:$i, Z1:$i > $o]:((Z1 @ Z0)))), inference(fof_simplification,[status(thm)],[def_is_of])). 0.20/0.50 thf(c_0_8, negated_conjecture, ~((all_of @ (^[X1:$i]:((in @ X1 @ nat))) @ (^[X1:$i]:((all_of @ (^[X248:$i]:((in @ X248 @ nat))) @ (^[X249:$i]:((all_of @ (^[X4:$i]:((in @ X4 @ nat))) @ (^[X4:$i]:((((n_is @ X1 @ X249))=>((n_is @ (n_pl @ X1 @ X4) @ (n_pl @ X249 @ X4)))))))))))))), inference(assume_negation,[status(cth)],[satz19b])). 0.20/0.50 thf(c_0_9, axiom, ((n_is)=(^[Z0:$i, Z1:$i]:(((Z0)=(Z1))))), inference(apply_def,[status(thm)],[def_n_is, c_0_5])). 0.20/0.50 thf(c_0_10, plain, ((all_of)=(^[Z0:$i > $o, Z1:$i > $o]:(![X4:$i]:(((((Z0 @ X4)))=>((Z1 @ X4))))))), inference(apply_def,[status(thm)],[c_0_6, c_0_7])). 0.20/0.50 thf(c_0_11, negated_conjecture, ~(![X358:$i]:(((in @ X358 @ nat)=>![X357:$i]:(((in @ X357 @ nat)=>![X356:$i]:(((in @ X356 @ nat)=>(((X358)=(X357))=>((n_pl @ X358 @ X356)=(n_pl @ X357 @ X356)))))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_8]), c_0_9]), c_0_10])). 0.20/0.50 thf(c_0_12, negated_conjecture, ((in @ esk1_0 @ nat)&((in @ esk2_0 @ nat)&((in @ esk3_0 @ nat)&(((esk1_0)=(esk2_0))&((n_pl @ esk1_0 @ esk3_0)!=(n_pl @ esk2_0 @ esk3_0)))))), inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])])). 0.20/0.50 thf(c_0_13, negated_conjecture, ((n_pl @ esk1_0 @ esk3_0)!=(n_pl @ esk2_0 @ esk3_0)), inference(split_conjunct,[status(thm)],[c_0_12])). 0.20/0.50 thf(c_0_14, negated_conjecture, ((esk1_0)=(esk2_0)), inference(split_conjunct,[status(thm)],[c_0_12])). 0.20/0.50 thf(c_0_15, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13, c_0_14])]), ['proof']). 0.20/0.50 % SZS output end CNFRefutation 0.20/0.50 % Parsed axioms : 370 0.20/0.50 % Removed by relevancy pruning/SinE : 298 0.20/0.50 % Initial clauses : 112 0.20/0.50 % Removed in clause preprocessing : 3 0.20/0.50 % Initial clauses in saturation : 109 0.20/0.50 % Processed clauses : 27 0.20/0.50 % ...of these trivial : 3 0.20/0.50 % ...subsumed : 0 0.20/0.50 % ...remaining for further processing : 23 0.20/0.50 % Other redundant clauses eliminated : 0 0.20/0.50 % Clauses deleted for lack of memory : 0 0.20/0.50 % Backward-subsumed : 0 0.20/0.50 % Backward-rewritten : 0 0.20/0.50 % Generated clauses : 6 0.20/0.50 % ...of the previous two non-redundant : 5 0.20/0.50 % ...aggressively subsumed : 0 0.20/0.50 % Contextual simplify-reflections : 0 0.20/0.50 % Paramodulations : 4 0.20/0.50 % Factorizations : 0 0.20/0.50 % NegExts : 0 0.20/0.50 % Equation resolutions : 1 0.20/0.50 % Disequality decompositions : 0 0.20/0.50 % Total rewrite steps : 6 0.20/0.50 % ...of those cached : 1 0.20/0.50 % Propositional unsat checks : 0 0.20/0.50 % Propositional check models : 0 0.20/0.50 % Propositional check unsatisfiable : 0 0.20/0.50 % Propositional clauses : 0 0.20/0.50 % Propositional clauses after purity: 0 0.20/0.50 % Propositional unsat core size : 0 0.20/0.50 % Propositional preprocessing time : 0.000 0.20/0.50 % Propositional encoding time : 0.000 0.20/0.50 % Propositional solver time : 0.000 0.20/0.50 % Success case prop preproc time : 0.000 0.20/0.50 % Success case prop encoding time : 0.000 0.20/0.50 % Success case prop solver time : 0.000 0.20/0.50 % Current number of processed clauses : 23 0.20/0.50 % Positive orientable unit clauses : 16 0.20/0.50 % Positive unorientable unit clauses: 0 0.20/0.50 % Negative unit clauses : 3 0.20/0.50 % Non-unit-clauses : 4 0.20/0.50 % Current number of unprocessed clauses: 87 0.20/0.50 % ...number of literals in the above : 272 0.20/0.50 % Current number of archived formulas : 0 0.20/0.50 % Current number of archived clauses : 0 0.20/0.50 % Clause-clause subsumption calls (NU) : 5 0.20/0.50 % Rec. Clause-clause subsumption calls : 5 0.20/0.50 % Non-unit clause-clause subsumptions : 0 0.20/0.50 % Unit Clause-clause subsumption calls : 5 0.20/0.50 % Rewrite failures with RHS unbound : 0 0.20/0.50 % BW rewrite match attempts : 0 0.20/0.50 % BW rewrite match successes : 0 0.20/0.50 % Condensation attempts : 0 0.20/0.50 % Condensation successes : 0 0.20/0.50 % Termbank termtop insertions : 15086 0.20/0.50 % Search garbage collected termcells : 5738 0.20/0.50 0.20/0.50 % ------------------------------------------------- 0.20/0.50 % User time : 0.011 s 0.20/0.50 % System time : 0.005 s 0.20/0.50 % Total time : 0.016 s 0.20/0.50 % Maximum resident set size: 5232 pages 0.20/0.50 0.20/0.50 % ------------------------------------------------- 0.20/0.50 % User time : 0.022 s 0.20/0.50 % System time : 0.009 s 0.20/0.50 % Total time : 0.031 s 0.20/0.50 % Maximum resident set size: 5120 pages 0.20/0.50 % E exiting 0.20/0.51 EOF